A Weighted Projection Centering Method
نویسنده
چکیده
An iterative method for finding the center of a linear programming polytope is presented. The method assumes that we start at a feasible interior point and each iterate is obtained as a convex combination of the orthogonal projection on the half spaces defined by the linear inequalities plus a special projections on the same half spaces. The algorithm is particularly suitable for implementation on computers with parallel processors. We show some examples in two dimensional space to describe geometrically how the method works. Finally, we present computational results on random generated polytopes and linear programming polytopes from NetLib to compare the centering quality of the center using projections and the analytic center approach. Mathematical subject classification: 90C99, 90C90.
منابع مشابه
Centering Similarity Measures to Reduce Hubs
The performance of nearest neighbor methods is degraded by the presence of hubs, i.e., objects in the dataset that are similar to many other objects. In this paper, we show that the classical method of centering, the transformation that shifts the origin of the space to the data centroid, provides an effective way to reduce hubs. We show analytically why hubs emerge and why they are suppressed ...
متن کاملPost-Tensioned Steel Connections Self-Centering Behavior Using the Finite Element Method
Due to lack of the proper and well behavior of steel moment-resisting connections subjected to the great and major earthquakes, excessive researches have been conducted to mitigate the damages on the primary elements and connections. Therefore, elimination of residual drift and increasing the plastic rotation capacity for the connectors in the panel zone are required. The main purpose of this s...
متن کاملA model based, anatomy dependent method for ultra-fast creation of primary SPECT projections
Introduction: Monte Carlo (MC) is the most common method for simulating virtual SPECT projections. It is useful for optimizing procedures, evaluating correction algorithms and more recently image reconstruction as a forward projector in iterative algorithms; however, the main drawback of MC is its long run time. We introduced a model based method considering the eff...
متن کاملWeighted Complementarity Problems - A New Paradigm for Computing Equilibria
This paper introduces the notion of a weighted Complementarity Problem (wCP), which consists in finding a pair of vectors (x, s) belonging to the intersection of a manifold with a cone, such that their product in a certain algebra, x ◦ s, equals a given weight vector w. When w is the zero vector, then wCP reduces to a Complementarity Problem (CP). The motivation for introducing the more general...
متن کاملA weighted denoising method based on Bregman iterative regularization and gradient projection algorithms
A weighted Bregman-Gradient Projection denoising method, based on the Bregman iterative regularization (BIR) method and Chambolle's Gradient Projection method (or dual denoising method) is established. Some applications to image denoising on a 1-dimensional curve, 2-dimensional gray image and 3-dimensional color image are presented. Compared with the main results of the literatures, the present...
متن کامل